Quantum computation via translation-invariant operations on a chain of qubits

نویسنده

  • Robert Raussendorf
چکیده

Symmetry reduces complexity. In physical systems realizing quantum computers, the highest degree of symmetry is therefore not the most desirable. A quantum computer needs to be sufficiently simple and robust to be controllable in an experiment yet complex enough to be universal. One may therefore ask the question, “how much symmetry does a quantum computer allow for?” In fact, a number of physical systems considered for the realization of a quantum computer such as optical lattices 1 or arrays of microlenses 2 are translation invariant, and the above question acquires a practical aspect. Quite surprisingly, it turns out that universal quantum computation can tolerate a fair amount of symmetry. Recently, a scheme of quantum computation using the rotationinvariant measurement of the total “spin” of two qubits as the only gate has been devised 3 . Furthermore, a translation-invariant computation scheme has been described 4 . The computational power of translation-invariant or nearly translation invariant quantum systems was revealed in Lloyd’s 5 and Watrous’ 6 work on quantum cellular automata QCA . In Ref. 6 it was shown that a onedimensional QCA can simulate any quantum Turing machine. Translation invariance is broken only by the initial state which encodes the program. The schemes in Refs. 5 and 7 allow one to simulate quantum circuits using a chain of qubits with a generic translation-invariant interaction. They require different species of qubits in a periodic arrangement and local addressability at one end-point of the chain. In the scheme in Ref. 8 such individual addressing is only required in the initialization. The method proposed in Ref. 4 is completely translation invariant in space. It requires homogeneous oneand two-local operations on five-level systems. Here I describe a scheme for universal quantum computation via translation-invariant operations on a chain of qubits. No individual addressability is required. The scheme uses an Ising-type interaction and spatially uniform onequbit gates. The qubits are all of the same species. Cold atoms in optical lattices 1 , where the requirement of local control adds to the overall technological challenge, are a candidate for the realization of the presented scheme. II. CONSTRUCTIVE ELEMENTS, UNIVERSALITY, AND SCALABILITY

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spinchainbased full quantum computation by accessing only two spins

We apply quantum control techniques to a long spin chain by acting only on two qubits at one of its ends, thereby implementing universal quantum computation by a combination of quantum gates on these qubits and indirect SWAP operations across the chain. It is shown that the control sequences can be computed and implemented efficiently.We discuss the application of these ideas to physical system...

متن کامل

Perturbation Theory and Numerical Modeling of Quantum Logic Operations with a Large Number of Qubits

The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain is considered in which selective excitations of spins are provided by having a uniform gradient of the external magnetic field. Quantum logi...

متن کامل

Reversible universal quantum computation within translation invariant systems

We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantu...

متن کامل

A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation

In measurement-based quantum computation, quantum algorithms are implemented via sequences of measurements. We describe a translationally invariant finite-range interaction on a one-dimensional qudit chain and prove that a single-shot measurement of the energy of an appropriate computational basis state with respect to this Hamiltonian provides the output of any quantum circuit. The required me...

متن کامل

Quantum Lorentz - group invariants of n - qubit systems

We consider the behavior of quantum states under stochastic local quantum operations and classical communication ~SLOCC! for an arbitrary fixed number of qubits. We use a real ~Lorentz! group to describe the action of SLOCC operations on n-qubit states. We discuss the natural quantum Lorentz-group group-invariant length for an arbitrary number of qubits. We relate this approach to that based on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005